Simplifying Smoktunowicz’s Extraordinary Example
نویسنده
چکیده
At the turn of the 21st century Agata Smoktunowicz constructed the first example of a nil algebra over a countable field such that the polynomial ring over the algebra is not nil. This answered an old question of Amitsur. We present a simplification of the example. Introduction This monograph began as the author’s earnest attempt to understand the beautiful example constructed in [1], and was originally meant only to serve as a set of personal notes. However, the author believes the simplifications offered will draw more people to understand and appreciate Smoktunowicz’s example. Further, as of the writing of this paper the example has been used in more than twenty other research papers, and continues to be generalized and expanded. It is hoped that this note will aid in this process and simplify future constructions. Almost all of the original research comes from Smoktunowicz’s work in [1], and many of the lemmas, theorems, and corollaries of this note are direct generalizations of results from that paper. The present paper reworks and streamlines the bounds and numerical computations of that paper. Further, following the methods of [2], we answer the implicit question left open at the end of the paper, showing that the main construction technique needs only one polynomial variable (and not two) to reach the desired example. Rather than construct each of the components of the example separately and then put them together at the end, we take a motivational approach where we give the underlying reason for each piece before it is constructed. It is hoped that this will aid the reader in keeping track of the important information as it is needed. As the paper is in essence a single example, any quantities defined outside of lemmas, theorems, or corollaries will continue to be defined throughout the paper and retain their meanings when invoked in proofs or in the statement of propositions. 1. Nilpotence over polynomial rings Let K be a countable field. Our goal is to construct a nil K-algebra R such that the polynomial ring R[X] is not nil. The first half of our goal is simple. We let A = K〈x1, x2, x3〉 be the (unital) free algebra in the three noncommuting variables x1, x2, and x3. We also let A ′ denote the (nonunital) Ksubalgebra of A consisting of the elements with zero constant term. We fix an indexing {f1, f2, f3, . . .} of A′ by the positive integers. This is the one and only place where we use the countability of K. For each i ≥ 1 we let ei be a positive integer and we let I be an ideal of A containing fi i for every i ≥ 1. We set R = A′/I and see that R is nil. As arbitrary ideals are difficult to work with, we take the simplifying position that I is a homogeneous ideal. Thus, we assume: (1) The ideal I is generated by the homogeneous components of {fi i : i ≥ 1}. One might ask: Why use three noncommuting variables to form A? It turns out that in fact two variables suffice (which will be shown at the end of this section), but with three the proof is significantly 2010 Mathematics Subject Classification. Primary 16N40, Secondary 16N20, 16S36.
منابع مشابه
A Complex Example of a Simplifying Rewrite System
For a string rewriting system, it is known that termination by a simpliication ordering implies multiple recursive complexity. This theoretical upper bound is, however, far from having been reached by known examples of rewrite systems. All known methods used to establish termination by simpliication yield a primitive recursive bound. Furthermore, the study of the order types of simpliication or...
متن کاملBalance control is simplified by muscle-skeletal leg design
Different gaits with upright body configurations make human bipedal locomotion unique [1]. Upper body balance is key to human locomotion. To balance, humans may control the direction of the ground reaction force [2] and the center of pressure, either continuously or step by step. Older infants learn standing and walking upright while holding tight to stable objects [3], thereby simplifying bala...
متن کاملDeformation Sensitive Decimation
In computer graphics, many automatic methods for simplifying polygonal meshes have been developed. These techniques work very well for static meshes; however, they do not handle the case of deforming objects. Simplifying any single pose of a deforming object may destroy detail required to represent the shape in a different pose. We present an automatic technique for simplifying deforming charac...
متن کاملMeasurement of the extraordinary refractive index dispersion in the MIR for Mg:Nd:LiNbO3 crystals by the use of quasi-phase-matching in a random 1D domain structure
We present a method of measurement of the extraordinary refractive index dispersion in MIR for periodically and aperiodically poled nonlinear crystals with unknown or uncertain periods. The method is based on the spontaneous parametric down-conversion and is useful for the crystals with domain structure formed directly in the process of growth by Czochralski technique. As an example we measure ...
متن کامل2 00 4 The role of electromagnetic traped modes in extraordinary transmition in nanostructured materials
We assert that the physics underlying the extraordinary light transmition (reflection) in nanostructured materials can be understood from rather general principles based on the formal scattering theory developed in quantum mechanics. The Maxwell's equations in passive (dispersive and absorptive) linear media are written in the form of the Schrödinger equation to which the quantum mechanical res...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012